Probability of Miscount in Counting Many Machine Parts with Counting Scale

Scale Counting

On Counting Polynomials of Some Nanostructures

The Omega polynomial(x) was recently proposed by Diudea, based on the length of strips in given graph G. The Sadhana polynomial has been defined to evaluate the Sadhana index of a molecular graph. The PI polynomial is another molecular descriptor. In this paper we compute these three polynomials for some infinite classes of nanostructures.

Fine-Grained Probability Counting: Refined LogLog Algorithm

Estimating the number of distinct flows, also called the cardinality, is an important issue in many network applications, such as traffic measurement, anomaly detection, etc. The challenging problem is that a high accuracy should be achieved with line speed and small auxiliary memory. The state-of-the-art, LogLog algorithm, uses loglogNmax memory, where Nmax is the priori upper bound for cardin...

Counting Features: quantifying discrete parts in visual object identification

People visually detect simple gratings, made of alternating bars of black and white, by detecting the bars independently. More generally, it seems that the visual identification of ordinary objects is based upon the independent detection of several features: discrete components of the image that are detected independently of each other (Robson and Graham, 1981; Pelli, Farell, and Moore, 2003). ...

Machine vision system for counting macadamia nuts

A need has been identified for more advanced technology to assist harvesting in the macadamia nut industry. An accurate automated method for counting nuts as they are harvested is required to replace manual labour in varietal strain investigation. A machine vision approach of counting the nuts in real time as they are collected has been chosen. This paper presents a machine vision system that i...